optimal search procedure

optimal search procedure
оптимальная процедура поиска

The English-Russian dictionary on reliability and quality control. 2015.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "optimal search procedure" в других словарях:

  • Bayesian search theory — is the application of Bayesian statistics to the search for lost objects. It has been used several times to find lost sea vessels, for example the USS Scorpion . The usual procedure is as follows:# Formulate a number of hypotheses about what… …   Wikipedia

  • Tabu search — is a mathematical optimization method, belonging to the class of local search techniques. Tabu search enhances the performance of a local search method by using memory structures: once a potential solution has been determined, it is marked as… …   Wikipedia

  • Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… …   Wikipedia

  • Reactive search — is the common name for a family of optimization algorithms based on the local search techniques. It refers to a class of heuristics that automatically adjust their working parameters during the optimization phase.OverviewReactive search, like all …   Wikipedia

  • operations research — the analysis, usually involving mathematical treatment, of a process, problem, or operation to determine its purpose and effectiveness and to gain maximum efficiency. [1940 45, Amer.] * * * Application of scientific methods to management and… …   Universalium

  • Stack (data structure) — In computer science, a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO) . Stacks are used extensively at every level of a modern computer system. For example, a modern PC uses stacks at the… …   Wikipedia

  • Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… …   Wikipedia

  • Princess and monster game — The princess and monster game is a pursuit evasion game played by two players on a graph. The game was devised by Rufus Isaacs and published in his book Differential games . [R. Isaacs, Differential Games: A Mathematical Theory with Applications… …   Wikipedia

  • Route assignment — Route assignment, route choice, or traffic assignment concerns the selection of routes (alternative called paths) between origins and destinations in transportation networks. It is the fourth step in the conventional transportation forecasting… …   Wikipedia

  • Fractional cascading — In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is… …   Wikipedia

  • perception — perceptional, adj. /peuhr sep sheuhn/, n. 1. the act or faculty of apprehending by means of the senses or of the mind; cognition; understanding. 2. immediate or intuitive recognition or appreciation, as of moral, psychological, or aesthetic… …   Universalium


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»